$F$-Square and Orthogonal $F$-Squares Design: A Generalization of Latin Square and Orthogonal Latin Squares Design

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nearly Orthogonal Latin Squares

A Latin square of order n is an n by n array in which every row and column is a permutation of a set N of n elements. Let L = [li,j ] and M = [mi,j ] be two Latin squares of even order n, based on the same N -set. Define the superposition of L onto M to be the n by n array A = (li,j ,mi,j). When n is even, L and M are said to be nearly orthogonal if the superposition of L onto M has every order...

متن کامل

More mutually orthogonal Latin squares

A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. In this paper we give some constructions of pairwise orthogonal diagonal Latin squares. As an application of such constructions we obtain some new infinite classes of pairwise orthogonal diagonal Latin squares which are useful in the study of pairwise orthogonal diagonal Latin squares.

متن کامل

A class of orthogonal latin square graphs

An orthogonal latin square graph is a graph whose vertices are latin squares of the same order, adjacency being synonymous with orthogonality. We are interested in orthogonal latin square graphs in which each square is orthogonal to the Cayley table M of a group G and is obtained from M by permuting columns. These permutations, regarded as permutations of G, are orthomorphisms of G and the grap...

متن کامل

Orthogonal latin squares of Sudoku type

Orthogonal latin squares of Sudoku type Hans-Dietrich Gronau Universität Rostock, Inst. für Mathematik 18051 Rostock, Germany We present results on the existence of orthogonal latin squares and latin rectangles of Sudoku type.

متن کامل

Enumeration of self-orthogonal Latin squares

The enumeration of self-orthogonal Latin squares (SOLS) of a given order seems to be an open problem in the literature on combinatorial designs. The existence of at least one SOLS is guaranteed for any order except 2, 3 and 6, but it is not known how many of these squares of a given order exist. In this talk we present enumeration tables of unequal SOLS, idempotent SOLS, isomorphism classes of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Mathematical Statistics

سال: 1970

ISSN: 0003-4851

DOI: 10.1214/aoms/1177696703